Encoded Bitmap Indexing for Data Warehouses

نویسندگان

  • Ming-Chuan Wu
  • Alejandro P. Buchmann
چکیده

Complex query types huge data volumes and very high read update ratios make the indexing techniques designed and tuned for traditional database systems unsuitable for data warehouses DW We propose an encoded bitmap indexing for DWs which improves the performance of known bitmap indexing in the case of large cardinality domains A performance analysis and theorems which identify properties of good encodings for better performance are presented We compare en coded bitmap indexing with related techniques such as bit slicing projection dynamic and range based indexing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indexing in Data Warehouses: Bitmaps and Beyond

Bitmap indexes (BIs) allow fast access to individual attribute values that are needed to answer a query by storing a bit for each distinct value and tuple. A BI is defined for a single attribute and the encodings are based solely on data values; the property map (PMap) is a multidimensional indexing technique that precomputes attribute expressions for each tuple and stores the results as bit st...

متن کامل

Automatic Selection of Bitmap Join Indexes in Data Warehouses

The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when queries access very large volumes of data. To improve response time, data warehouse administrators generally use indexing techniques such as star join indexes or bitmap join indexes. This task is nevertheless complex and fas...

متن کامل

Bitmap Join Indexes vs. Data Partitioning

IntroductIon Scientific databases and data warehouses store large amounts of data ith several tables and attributes. For instance, the Sloan Digital Sky Survey (SDSS) astronomical database contains a large number of tables with hundreds of attributes, which can be queried in various combinations (Papadomanolakis & Ailamaki, 2004). These queries involve many tables using binary operations, such ...

متن کامل

Shared Index Scans for Data Warehouses

Yannis Kotidis1, Yannis Sismanis2, and Nick Roussopoulos2 1 AT&T Labs, 180 Park Ave, P.O. Box 971 Florham Park, NJ 07932-0000 USA [email protected] 2 Institute for Advanced Computer Studies, University of Maryland, College Park fisis,[email protected] Abstract. Tree based indexing structures like B-trees, B+-trees, Bitmap indexes and R-trees have become essential for getting good performa...

متن کامل

A Data Mining Approach for selecting Bitmap Join Indices

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998